On cyclic tournaments

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An existence theorem for cyclic triplewhist tournaments

We show that a Z-cyclic triplewhist tournament TWh(v) exists whenever v =p] . . . . p~ where the primes p~ are -5(mod8) , p~>29. The method of construction uses the existence of a primitive root ~o of each such Pi (~61) such that ~o2+eo+ 1 are both squares (modpi).

متن کامل

Z-cyclic whist tournaments for q players

Expanding upon a comment by P. A. Leonard (1996, Utilitas Math. 49, 223-232), we exhibit Z-cyclic patterned-starter based whist tournaments for q2 players, where q = 4k+3 is prime; the cases 3 < q < 200 are included herein, with data for 200 < q < 3,500 available electronically.

متن کامل

A new construction for Z-cyclic whist tournaments

In this paper, a new construction for Z-cyclic whist tournaments is given. The known existence results for both Z-cyclic whist tournaments and Z-cyclic triplewhist tournaments are extended. ? 2003 Elsevier B.V. All rights reserved.

متن کامل

On the Distinguishing Number of Cyclic Tournaments: Towards Albertson-Collins Conjecture

A distinguishing r-labeling of a digraph G is a mapping λ from the set of vertices of G to the set of labels {1, . . . , r} such that no nontrivial automorphism of G preserves all the labels. The distinguishing number D(G) of G is then the smallest r for which G admits a distinguishing r-labeling. From a result of Gluck (David Gluck, Trivial set-stabilizers in finite permutation groups, Can. J....

متن کامل

A Problem on Tournaments

By a tournament we mean the outcome of a round-robin tournament in which there are no draws . Such a tournament may be represented by a graph in which the n players are represented by vertices labelled 1, 2, . . . , n, and the outcomes of the games are represented by directed edges so that every pair of vertices is joined by one directed edge . We call such a graph a complete directed graph . O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hokkaido Mathematical Journal

سال: 1992

ISSN: 0385-4035

DOI: 10.14492/hokmj/1381413682